1. Every outerplanar graph is also a circle graph . 2. A polygon-circle graph can be represented as an " alternating sequence ". 3. Several authors have investigated problems of coloring restricted subclasses of circle graphs with few colors. 4. However, there are also problems that remain NP-complete when restricted to circle graphs . 5. Every outerplanar graph is a circle graph , the intersection graph of a set of chords of a circle. 6. Every distance-hereditary graph is a circle graph , as is every permutation graph and every indifference graph. 7. :My assumption was that by " a circle graph " the questioner was referring to a pie chart. 8. They are a superclass of the trapezoid graph class, and also contain circle graphs and circular-arc graphs. 9. Every distance-hereditary graph can be represented as the intersection graph of chords on a circle, forming a circle graph . 10. The outerplanar graphs are a subset of the planar graphs, the subgraphs of series-parallel graphs, and the circle graphs .
Mobile